A NEW OPTIMIZED RUNGE-KUTTA METHOD FOR SOLVING OSCILLATORY PROBLEMS
نویسندگان
چکیده
منابع مشابه
A New Optimized Runge-Kutta-Nyström Method to Solve Oscillation Problems
In this article, a new Runge-Kutta-Nyström method is derived. The new RKN method has zero phase-lag, zero amplification error and zero first derivative of phase-lag. This method is basically based on the sixth algebraic order Runge-Kutta-Nyström method, which has proposed by Dormand, El-Mikkawy and Prince. Numerical illustrations show that the new proposed method is much efficient as compared w...
متن کاملOptimized explicit Runge-Kutta schemes for the spectral difference method applied to wave propagation problems
Explicit Runge–Kutta schemes with large stable step sizes are developed for integration of high order spectral difference spatial discretizations on quadrilateral grids. The new schemes permit an effective time step that is substantially larger than the maximum admissible time step of standard explicit Runge–Kutta schemes available in literature. Furthermore, they have a small principal error n...
متن کاملRunge-Kutta Method for Solving Uncertain Differential Equations
*Correspondence: [email protected] Department of Mathematical Sciences, Tsinghua University, Beijing 100084, China Abstract Uncertain differential equations have been widely applied to many fields especially to uncertain finance. Unfortunately, we cannot always get the analytic solution of uncertain differential equations. Early researchers have put up a numerical method based on t...
متن کاملA New Method for Solving Constraint Satisfaction Problems
Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling" means assigning a value to a variable.) Sol...
متن کاملA New Method for Solving Constraint Satisfaction Problems
Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling means assigning a value to a variable.) Solu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Pure and Apllied Mathematics
سال: 2016
ISSN: 1311-8080,1314-3395
DOI: 10.12732/ijpam.v106i3.2